Online Routing and Scheduling With Capacity Redundancy for Timely Delivery Guarantees in Multihop Networks

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Proportional Fair Scheduling with Capacity Estimation for Wireless Multihop Networks

In this paper, we investigate the scheduling problem to achieve the proportional fairness among the flows in wireless multihop networks with time-varying channel capacity. Using the signal to interference noise ratio and the outage probability, we present an estimate of time-varying capacity. Then, we achieve the proportional fairness in terms of maximizing the network utility functionwith cons...

متن کامل

Multi-objective routing and scheduling for relief distribution with split delivery in post-disaster response

Following the occurrence of unexpected events and natural disasters, a highly important relief operation is the transferring of relief commodities from the distribution centers (CDs) to shelters. In this paper, a three-level network consisting of depot of vehicles, distribution centers and shelters has been considered for routing and scheduling of relief vehicles through introducing a multi-obj...

متن کامل

Joint Routing, Scheduling And Power Control For Multihop Wireless Networks With Multiple Antennas

We consider the problem of Joint Routing, Scheduling and Power-control (JRSP) problem for multihop wireless networks (MHWN) with multiple antennas. We extend the problem and a (sub-optimal) heuristic solution method for JRSP in MHWN with single antennas. We present an iterative scheme to calculate link capacities(achievable rates) in the interference environment of the network using SINR model....

متن کامل

Combinatorial Approach for Geographic Routing with Delivery Guarantees

In this paper we present a novel combinatorial approach for geographic routing with delivery guarantees. Proposed algorithm can be seen as a variant of GFG (Greedy Face Greedy of Bose et.al) algorithm, but based on the defined combinatorial properties of the graph. We utilize a distributed planarization algorithm of a geometric graph, which is based on the Schnyder's characterization of planar ...

متن کامل

A Framework for Integrated Power Control, Routing and Link Scheduling in Multihop CDMA Networks

In this paper, we propose a general framework for integration of power control, routing and scheduling relying on time-scales in multihop ad hoc CDMA networks. We exploit the longer time-scale available for link (not packet) scheduling to perform that complex operation only periodically and suggest a feasible incremental strategy for admission control and re-routing between scheduling ”refreshe...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE/ACM Transactions on Networking

سال: 2019

ISSN: 1063-6692,1558-2566

DOI: 10.1109/tnet.2019.2917393